Upper Bounds of Entire Chromatic Number of Plane Graphs
نویسندگان
چکیده
منابع مشابه
Upper Bounds of Dynamic Chromatic Number
A proper vertex k-coloring of a graph G is dynamic if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic k-coloring is the dynamic chromatic number χd(G). We prove in this paper the following best possible upper bounds as an analogue to Brook’s Theorem, together with the determination of chromatic...
متن کاملUpper bounds for the 2-hued chromatic number of graphs in terms of the independence number
A 2-hued coloring of a graph G (also known as conditional (k, 2)-coloring and dynamic coloring) is a coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. The smallest integer k such that G has a 2-hued coloring with k colors, is called the 2-hued chromatic number of G and denoted by χ2(G). In this paper, we will show that if G is a re...
متن کاملTwo Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1999
ISSN: 0195-6698
DOI: 10.1006/eujc.1998.0258